Multi-constraint routing system and method

ABSTRACT

A routing system and method are provided which use a composite cost in identifying routes. This allows a simple way of identifying the best route taking multiple metrics into account for each link simultaneously. The system allows for the inclusion of pruning constraints, and allows for various objectives such as bin packing or load balancing to be achieved.

RELATED APPLICATIONS

[0001] This application is a Continuation-in-part of the U.S. patent application to Lee et al. entitled “Multi- Constraint Routing System and Method”, Ser. No. 10/025,869 filed on Dec. 26, 2001, and claims priority of U.S. provisional application to Lee et al of the same title, Serial No. 60/362,926 filed on Mar. 11, 2002.

FIELD OF THE INVENTION

[0002] The invention relates to systems and methods of identifying routes through a network in accordance with multiple constraints.

BACKGROUND OF THE INVENTION

[0003] The problem of identifying routes through a network subject to a single constraint is well known. For example, Shortest Path First Algorithms by Dijkstra and Bellman-Ford are well known, and both use a single cost, single constraint approach. Dijkstra's method finds the shortest path between a source and any other node in the network.

[0004] The problem of routing while considering multiple constraints, while newer than the single constraint problem, has been addressed in a number of ways. See for example Kenji Ishida, Kitsutaro Amano, “A delay-constrained least-cost path routing protocol and the synthesis method”, IEEE conference, 1998; Ariel Orda, “Routing with End to End QoS guarantees in broadband networks”, IEEE conference, 1998; H. F. Salama, D. S. Reeves, Y. Viniotis, “A distributed algorithm for delay-constrained unicast routing”, IEEE conference, 1997; J. Song, H. K. Pung, L. Jacob, “A multi-constrained distributed QoS routing algorithm”, IEEE conference, 2000; S. Chen, K. Nahrstedt, “On finding multi-constrained paths”, IEEE conference, 1998; J. Zhou, “A new distributed routing algorithm for supporting delay-sensitive applications”, ICCT, 1998.

[0005] Most of these approaches use the Dijkstra or Bellman-Ford algorithms as a base algorithm to find a sub-optimal path.

[0006] Typical IGP (Internal Gateway Protocol) routing protocols such as OSPF (Open Shortest Path First) advertise a single link metric termed “administrative cost”. The default link metric in some cases for this “administrative cost” is the inverse of link bandwidth. Other implementations may use monetary cost, propagation delay etc.

[0007] IGP-TE (traffic engineering extension to IGP) adds one more metric which can be advertised within a network. In general, the TE-metric is used to carry any arbitrary metric for constraint-based routing of a set of LSPs (Label Switched paths) needing optimization. The current common practice is to use the IGP metric as a second TE metric, see e.g. IEFT draft “Use of IGP Metric as a second TE Metric” by Francois Le Faucheur et al (expires April 2002) which can be found at http://search.ietf.org/internet-drafts/draft-lefaucheur-te-metric-igp-01.txt

[0008] Proposals have also been made to extend the number of TE metrics which are to be advertised up to three, see e.g. IEFT draft “Multiple metrics for Traffic Engineering with IS-IS and OSPF” by Don Fedyk et al (expired May 2001) which can be found at http://search.ietf.org/internet-drafts/draft-fedyk-isis-ospf-te-metrics-01.txt

[0009] The cost associated with a path between a source and destination is the sum of the costs of the links that constitute the entire path. Existing proposals recommend not to strive for optimization of both the TE metric and the IGP metric during path computation for a given LSP. This is known to be an NP-complete (non-polynomial complete) problem.

[0010] Thus there is a need for heuristic strategies and systems for performing multi-constraint routing to minimize the cost for the entire path.

SUMMARY OF THE INVENTION

[0011] One broad aspect of the invention provides a method of performing multi-constraint routing. The method involves determining a composite cost, composite cost(link)=f(metric1, . . . ,metricN), for each of a plurality of links under consideration in a network topology, the composite cost being a function f of a plurality of metrics metric1, . . . metricN for each link, where N>=2; and performing routing through the network topology from a source to a destination based on the composite costs.

[0012] In some embodiments, the composite cost is determined according to: ${{composite}\quad {{cost}{\quad \quad}({link})}} = {\sum\limits_{i = 1}^{N}{c_{i}\left( {metric}_{i} \right)}^{n{(i)}}}$

[0013] where ci is a constant for the ith metric, and n(i) is an exponent for the ith metric.

[0014] In some embodiments, the composite cost is determined according to:

composite cost(link)=a*(1/abw)+b*Admin cost+c*Delay;

[0015] where metric1=abw=available bandwidth, metric2=Admin cost and metric3=Delay=transmission delay, and wherein c1=a, c2=b, and c3=c, n(1)=−1, n(2)=1 and n(3)=1.

[0016] In some embodiments for each link, at least one network node advertises the link's metrics across the network such that any node in the network may implement the multi-constraint routing.

[0017] In some embodiments, wherein the composite cost increases with decreasing available bandwidth, routing is performed in a manner which promotes load balancing.

[0018] In some embodiments, the routing is performed in a manner which promotes load balancing with demand reservation on at least one link. This may involve for example defining a respective demand threshold (demand_threshold) for at least one link representing demand reservation for the at least one link.

[0019] This may involve adjusting the costs according to:

if (available bandwidth<=demand_threshold) cost(link)=composite cost(link)+MAX COST

[0020] else

cost(link)=composite cost(link)

[0021] where demand_threshold is a respective demand reservation for the link, and MAX COST is a very large value.

[0022] Typically, the demand_threshold is set to a first value for at least one of the links, and is set to a second larger value for at least one of the links whereby bandwidth on the at least one of the links having the first value is reserved for larger bandwidth requests.

[0023] In some embodiments, for each of a plurality of different traffic types, a respective different composite cost equation is used for calculating the composite costs. The different traffic types might for example include video, voice and data, and might include different classes of service/qualities of service.

[0024] In another embodiment, a link cost is computed based on the composite cost for switching between a load balancing mode and a bin-packing mode based on available bandwidth of each of a plurality of links under consideration using a predetermined demand_threshold value in a network topology. In this method the cost for each said at least one link is determined as follows:

If (abw<=demand_threshold) cost(link)=a*Admin cost+b*(abw ^(K) /PIR)+c*Delay+MAX COST

[0025] else

cost(link)=a*Admin cost+b*(PIR/abw ^(K))+c*Delay;

[0026] wherein PIR=Peak Information Rate, MAX COST is a large number, abw is the available bandwidth and K is a constant.

[0027] The constant K can be used to control a rate at which the cost changes with a variation in the available bandwidth. The large number (MAX COST) is added to the cost (link) to prevent the link from being selected, when there is at least one link with available bandwidth higher than the demand_threshold.

[0028] In still another embodiment, the cost for each said at least one link is determined as follows:

If (available bandwidth<=demand_threshold) cost(link)=a*Admin cost+b*(PIR/ abw ^(K))+c*Delay+MAX COST

[0029] else

cost(link)=a*Admin cost+b*(abw ^(K) /PIR)+c*Delay;

[0030] wherein PIR=Peak Information Rate, MAX COST is a large number, abw is the available bandwidth and K is a constant.

[0031] The constant K can be used to control a rate at which the cost changes with a variation of the available bandwidth. In this embodiment, a different demand_threshold value is used for at least one link for achieving a different switch-over point between load balancing and bin-packing. In some embodiments, the method further involves providing at least one pruning constraint for each link, and pruning the network topology on the basis of the at least one pruning constraints to remove at least one link from the network topology. In this case, performing routing through the network from a source to a destination based on the composite costs is conducted using only the links not pruned from the network topology. The pruning of the network topology on the basis of the at least one pruning constraints to remove at least one link from the network topology is performed on an as-needed basis to remove one or more links from a set of candidate links.

[0032] Alternatively, pruning the network topology on the basis of the at least one pruning constraints to remove at least one link from the network topology may be performed on the entire network topology prior to performing the routing.

[0033] In some embodiments, at least one constraint is used both as a pruning constraint and as a constraint used in the composite costs.

[0034] Another broad aspect of the invention provides a routing system adapted to perform multi-constraint routing. The routing system has a topology repository adapted to store information identifying links, nodes and connections of a network. The routing system further comprises an input for receiving on an ongoing basis for each link, updated values for the metrics for the link. There is a multi-constraint router adapted to determine a composite cost; wherein

composite cost(link)=f(metric1, . . . ,metricN)

[0035] for each of a plurality of the links in the network topology, the composite cost being a function f of a plurality of metrics metric1, . . . metricN for each link, where N>=2, and to perform routing through the network topology from a source to a destination based on the composite costs. The routing system may be implemented to provide any one or more of the above introduced methods.

[0036] In another embodiment the routing system is adapted to compute the cost for each said at least one link based on the composite cost for switching between a load balancing mode and a bin-packing mode based on available bandwidth of each of a plurality of links under consideration in a network topology. The switching between the load balancing and the bin-packing modes is performed based on a predetermined demand_threshold value. A different demand_threshold value is used for at least one link for achieving a different switch over point between load balancing and bin-packing.

BRIEF DESCRIPTION OF THE DRAWINGS

[0037] Preferred embodiments of the invention will now be described with reference to the attached drawings in which:

[0038]FIG. 1 is a block diagram of an example system within which an embodiment of the invention may be employed;

[0039]FIG. 2 is a block diagram of the routing system of FIG. 1;

[0040]FIG. 3 is a flowchart of an example method of routing by the routing system of FIG. 2;

[0041]FIG. 4 is a table of constraints and constraint types;

[0042]FIG. 5 is an example network topology;

[0043]FIG. 6 is an example set of metrics for the network topology of FIG. 5;

[0044]FIG. 7 is the network topology of FIG. 5 with composite costs;

[0045]FIG. 8 depicts a first hybrid load balancing heuristic;

[0046]FIG. 9 is a flowchart showing the method for computing the composite cost for a link in another embodiment of the routing system;

[0047]FIG. 10 is a graph explaining the operation of the system of FIG. 9;

[0048]FIG. 11 is a flowchart showing the method for computing the composite cost for a link in still another embodiment of the routing system; and

[0049]FIG. 12 is a graph explaining the operation of the system of FIG. 11.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0050]FIG. 1 is a diagram of an example system within which an embodiment of the invention may be employed. The system has a CM (connection management) function 16 through which requests for new connections are received. An MPLS (multi-protocol label switching) protocol 14 is used to propagate requests to network components after a potential route has been identified. A CAC (call admission control) function 10 controls whether or not calls are to be admitted. An RT (resource tracker) 12 keeps track of resources. The CM 16 interacts with a routing system 19 which has an MCR (multi-constraint routing) function 18 which identifies routes through a network as a function of a network topology indicated at 20.

[0051] The process in setting up a connection involves first a customer 13 sending a service request to a network management system 11 which forwards the request to CM 16 which translates the request into a meaningful path request message (with source, destination, constraints). CM 16 then requests a path from routing system 19. The MCR function 18 within the routing system 19 calculates an optimal path between the source and destination satisfying the constraints using a new algorithm provided by an embodiment of the invention. Then, CM 16 requests MPLS 14 (or other route establishment system) to set up the path. MPLS 14 checks for resource availability before sending the request on to the next hop as indicated by arrow 15.

[0052] In one embodiment, given a network G=<N,E>, where N is the set of nodes and E the set of links, the task of the MCR function 18 is to find an optimal path between a given source and destination satisfying two sets of constraints. The first set of constraints is referred to herein as pruning constraints, and these constraints are constraints which allow the elimination of one or more routes from the set of possible routes. These are constraints that assist in narrowing the search to a reduced candidate path set. Examples of potential pruning constraints include bandwidth, pre-emption, path exclusion, Peak Information Rate (PIR), and link protection. The second set of constraints is referred to herein as cost constraints, and these are used in considering routes left over after application of the pruning constraints. These constraints are used in calculation of cost for every path in the reduced candidate set. Examples of potential cost constraints include administrative cost (administrative cost), available bandwidth (abw), and delay. Not every implementation necessarily will include pruning constraints, but all implementations will include cost constraints. Some constraints may be used both as pruning and cost constraints.

[0053] An example set of constraints is shown in the table of FIG. 4 where eleven different example constraints are given. Bandwidth per CoS (class of service) may be employed as a pruning or cost constraint. The pre-emption state of a link (indicating whether it is pre-emptable or not) may be used as a pruning constraint. Path exclusion (indicating that a particular path should not be used, e.g. maintenance) is also a pruning constraint. The source-destination fixed delay is a cost constraint. L1 logical link protection and L2 logical link protection are pruning constraints as are the PIR, group path bandwidth, and path diversity. Best effort load balancing and administrative cost are both cost constraints. It is to be understood that this is a non-limiting set of example constraints. Some or all and/or completely different constraints than these example constraints may be employed in an actual implementation. In some applications, it may be useful to classify the constraints differently than as outlined above.

[0054] A more detailed block diagram of the routing system 19 is shown in FIG. 2. The routing system 19 has a MCR control layer 30 which co-ordinates the receipt and response to requests from the connection management function CM 16. A pruning filter 32 performs pruning on the network topology 20 to produce a modified network topology 34. Cost function 38 performs a cost calculation on the modified network topology 34 and identifies a minimum cost path.

[0055] The function of the routing system in identifying a route from a source node to a destination node will be described in further detail with reference to the flowchart of FIG. 3. In identifying the route, two different lists are maintained on an ongoing basis. The first such list is referred to as the link_list, and is the list of links directly connected to a current node (the node for which a next link in the route is to be identified). The second such list is referred to as the candidate_list, and is the list of all possible routes/partial routes identified thus far. These lists are clarified below.

[0056] In step 3-1, the algorithm starts at each current node with the creation of a link_list consisting of all links connecting to the current node. Initially, the current node is the source node, and the initial link₁₃ list will be all links connecting directly to the source node. Also, initially, the candidate_list will be empty. It is noted that the whole algorithm is typically run by the same node, and the nodes referred to are logical nodes in the network topology.

[0057] In step 3-2, all links in the link_list that do not satisfy the pruning constraints are pruned, i.e. removed from the link_list.

[0058] In step 3-3, the candidate_list is updated as a function of the pruned link_list. For the first iteration, the candidate_list is set to equal the link_list of links leaving the source node. For subsequent iterations, the candidate_list is updated by adding to the candidate_list routes which make use of a previous route in the candidate_list plus a link in

[0059] In step 3-4, for all routes newly added to the candidate_list, a cost is calculated based on the cost constraints. This involves first calculating the cost for each link in the pruned link_list. Then, the cost for a particular route which makes use of a previous route in the candidate_list and a particular link from the pruned link_list is calculated by adding the cost of the previous route to the cost of the link from the pruned link_list.

[0060] Finally, in step 3-5, the route that has the least cost as determined by the cost constraints is selected for the current iteration. The next “current node” is the node terminating the selected route. When a particular route is selected, the previous route in the candidate_list which was used to build the particular route is removed from the candidate list. All other routes remain in the candidate list.

[0061] These steps are repeated until the destination is reached.

[0062] In another embodiment, the pruning of the entire network topology is done at the very beginning, and then a standard routing protocol run on the remaining topology.

[0063] Another broad aspect of the invention provides a cost function for use in performing routing functions. In one embodiment, the cost function is employed in conjunction with the above-described system with two constraint types. More generally, the approach can be used in any routing system. A new composite cost function having the following format is employed:

composite cost(link)=f(metric1, metric2, . . . ,metricN)

[0064] where f(.) is a multi-variable function, and metric1, . . . ,metricN are metrics advertised for each link. In all cases N>=2, and in a preferred embodiment, N=3.

[0065] In a specific example, the composite cost function has the following format: ${{composite}\quad {{cost}{\quad \quad}({link})}} = {\sum\limits_{i = 1}^{N}{c_{i}\left( {metric}_{i} \right)}^{n{(i)}}}$

[0066] where ci is a scaling constant for the ith metric, and n(i) is an exponent. In a particular example of this format, consider the case where the three metrics are bandwidth, administrative cost and delay. A very specific preferred format of the composite cost is:

Cost(link)=a*(1/abw)+b*Admin cost+c*Delay

[0067] where a, b, c are constants that can be engineered depending upon goals defined for the routing system. In this equation, “abw” is the available bandwidth, and “a” is the bandwidth coefficient. Admin cost is the administrative cost provided by administrator, and “b” is the administrative cost coefficient. Delay is the transmission delay introduced by the link and “c” is the delay coefficient. In this case, metric1=available bandwidth, metric2=Admin cost and metric3=delay, and wherein c1=a, c2=b, and c3=c, n(1)=−1, n(2)=1 and n(3)=1.

[0068] It should be noted that this composite cost function approach is not an attempt to optimize multiple link metrics simultaneously, which can be degenerated to an NP-complete problem. Rather, it is an approach to take multiple link metrics into consideration in a flexible manner.

[0069] An example network topology to which the MCR function may be applied is shown in FIG. 5. FIG. 5 shows a topology consisting of eight nodes labeled A, B, C, D, E, F, G and H, and having twelve links AB, AD, AE, BC, BE, CF, CD, DG, EF, EH, GF, FH. This network topology will be used in example applications described below. It is assumed that link AE is a layer 2 logical link which would actually pass through node B.

[0070] An example set of metrics associated with the various links of FIG. 5 is presented in the table in FIG. 6. There is a set of parameters for each link, and in the event a given link has a protection path, there is a set of parameters for the protection path. In the illustrated example, it is assumed that links CD and AD have both working and protection paths. Each link has an available bandwidth field which indicates an available bandwidth metric for the link. This needs to be updated each time a new route is provisioned on a given link. Each link has a maximum bandwidth field indicating the maximum total bandwidth supported by the link. Each link also has an administrative cost metric and a delay metric. The available bandwidth, admin cost, and delay are preferably advertised network wide by whatever node in the system has first hand knowledge. For embodiments in which pruning is to be performed on the basis of the type of protection available for links, the table would include for each link an L1LL field when appropriate indicating for layer 1 links the type of protection for the link if any. Each link would also have an L2LL field when appropriate indicating for layer 2 logical links the type of protection for the link if any.

[0071] For this example, it is assumed that a customer wants to set up a link between nodes A and F. The connection management function 16 processes the request, and converts it into a request which makes sense to the routing system 19. In one example, the request is converted into the following set of parameters:

[0072] The minimum set of parameters are source, destination and bandwidth:

[0073] Source—identifies the source node for the request;

[0074] Destination—identifies the destination node for the request;

[0075] Bandwidth—the requested bandwidth for the connection.

[0076] In some implementations, one or more of the following may also be included as part of the request:

[0077] Pre-emptable state—identifies whether the link is pre-emptable—only required in embodiments contemplating pruning based on this state. For this example, it is assumed that pruning based on this state is not to be employed;

[0078] Delay—identifies a maximum delay tolerable for the requested route. Other parameters/constraints might also be included.

[0079] An example request might be as follows:

(source=A, destination=F, bandwidth=150)

[0080] These parameters would be passed to the routing system 19 which then identifies the best route through the network. For this example, the previously introduced cost function is used, namely:

composite cost (link)=a*(1/abw)+b*Admin cost+c*Delay

[0081] and for this example, we assume that a=1000, b=100, and c=100.

[0082] Referring to FIG. 7, shown is a version of FIG. 5 with the composite cost values filled in for each link. The working and protection paths for links AD and DC are also shown. It is noted that the composite costs need not necessarily be all computed at once, but rather in a stepwise fashion as required, and as described below. Next, any routing algorithm may be employed using the composite costs as a single cost per link.

[0083] The composite cost approach, which employs the inverse of the available bandwidth, will result in load balancing occurring across available links, at least to a certain degree depending upon the impact of the other metrics on the composite cost. Load balancing means that the occupancy of the various links will increase in a somewhat balanced way.

[0084] In another embodiment of the invention, a different cost function is employed for different connection requests. The particular cost function may for example be selected as a function of traffic type for the connection. For example, the traffic types might include voice, video, and data, and three different cost functions may be employed for these different traffic types. By way of a very specific example, for the three metric example given above, this can be summarized as follows: a = bandwidth b = admin c = delay Traffic Type coefficient coefficient coefficient Video a1 b1 c1 Voice a2 b2 c2 Data a3 b3 c3

[0085] Then, if a request comes in for a video connection, the costs are computed using a1, b1 and c1. If a request comes in for a voice connection, the costs are computed using a2, b2 and c3. Finally, if a cost comes in for a data connection, the costs are computed using a3, b3 and c3.

[0086] More generally, a different cost equation may be used for different connection request types. This could be based on class of service/quality of service, or some other type of characteristics.

[0087] In another embodiment of the invention, the composite costs can be manipulated in such a way as to promote load balancing with demand reservation. Bin-packing involves preferentially reserving a portion of bandwidth on certain links until a sufficiently large bandwidth request is received, thereby ensuring that the large bandwidth request can in fact be serviced. Consider a simple example in which two possible links each have a maximum bandwidth of 100. If load balancing is employed until such time that the two links have an occupancy of 85 and 90 respectively, a new request for 20 will not be serviceable on either link. To decrease call blocking probabilities, bin-packing routes all traffic to one link until full then moves on to next link but this introduces congestion on particular links and does not follow the load balancing approach.

[0088] In this embodiment, the links are load balanced up to certain points. Demand reservation is employed to reserve some capacity for larger bandwidth connections. For this example, in order for load balancing to occur, there must be an available bandwidth term in the composite cost, and the composite cost must increase with decreasing available bandwidth such as is the case when a term a (1/available bandwidth) is included. An example of load balancing with demand reservation will be described with reference to FIG. 8. Shown is the bandwidth occupancy of two alternative links, link1 and link2. A demand threshold DT is indicated for the two links. In the example, the DT for link1 is 30 and the DT for link2 is 10, the demand threshold being a measure in per cent of a specified fraction of the maximum bandwidth, normalized to 100. Load balancing is employed up to and including when a connection is made which results in a watermark being exceeded by one or more of the links. Load balancing means the normal composite costs introduced earlier are used in performing the routing function. At that point, a new conditional composite cost is calculated as follows for links which are to have reserved bandwidth:

if (abw≦DT (demand_threshold) cost(link)=composite cost(link)+MAXCOST

[0089] else

cost(link)=composite cost(link)

[0090] where “MAXCOST” is just a large number, which will prevent the link from being selected. If two links both have this MAXCOST then they will cancel each other out and load balancing will prevail. Thus, in the simple two link example, after the watermark is passed, one of the links is selected to have reserved bandwidth for higher bandwidth requests. In the illustrated example, the demand threshold for link1 has been crossed and there is an available bandwidth of 27. The demand threshold for link2 has not been crossed and there is an available bandwidth of 15. Now, if a requested bandwidth of 25 is received, there is room for this on link1 because of the demand reservation made for that link. When both demand thresholds are crossed, the method reverts to load balancing again.

[0091] In another embodiment of the invention, routing is performed in a manner which promotes load balancing as well as bin-packing and the routing strategy switches between a load balancing mode and a bin-packing mode based on the available bandwidth of the links. For example, when the available bandwidths of the candidate links under consideration during path selection are higher than the demand_threshold, load balancing is performed, whereas for lower values of available bandwidth, bin-packing is used. In this embodiment of the routing system, the method for computing the composite cost for a link is shown in flow chart 9-0 of FIG. 9. Upon start (box 9-1), when the available bandwidth of a candidate link considered during a step in path selection is more than demand_threshold (exit “No” from box 9-2), step 9-4 of FIG. 9 is executed followed by termination of the method (box 9-5). The equation in step 9-4 indicates that composite cost(link) increases with a decrease in the available bandwidth (abw). K is a constant that can be used to control the rate at which the cost increases. Thus, the algorithm selects a link with a higher available bandwidth, i.e., a less congested link over a link with the same Admin cost and Delay parameters but a lesser available bandwidth. This tends to distribute the load evenly across the links giving rise to load balancing.

[0092] When the available bandwidth of a link under consideration is less than or equal to the demand_threshold (exit “Yes” from box 9-2), step 9-3 of FIG. 9 is executed followed by termination step 9-5. The equation in step 9-3 indicates that composite cost(link) decreases with a decrease in available bandwidth. Given two candidate links with the same Admin cost and Delay parameters, the routing algorithm will choose a link with a lower available bandwidth (lower cost) over a less congested link. This scenario corresponds to bin-packing: the congested link is used up first, leaving spare capacity on the less loaded links that can potentially accommodate a request with a high bandwidth demand in the future. The behavior of the algorithm is captured in FIG. 10. The addition of a large number MAX COST (see box 9-3), prevents a link from being selected when other candidate links are operating under the demand_threshold. When abw for all these links are less than or equal to demand_threshold, the system enters the bin-packing mode. Two values for the demand_threshold, 0 and PIR, may be considered further. By setting demand_threshold to 0, step 9-3 in FIG. 9 is never executed and the system always operates in a load balancing mode. Similarly by setting demand_threshold to any value higher than PIR, step 9-4 is never executed and the system always operates in a bin-packing mode.

[0093] In another embodiment, the method enables the system to perform load balancing as well as bin-packing, wherein the routing strategy switches between a load balancing mode and a bin-packing mode based on the available bandwidth of links in such a manner that when the available bandwidths of the candidate links considered during path selection are higher than demand_threshold, bin-packing is performed and load balancing is used for lower values of available bandwidths. The composite cost for a link is computed using the method shown in flow-chart 11-0 in FIG. 11. Upon start (box 11-1), and as long as the available bandwidth of a link is more than the demand_threshold (exit “No” from box 11-2), step 11-4 is executed followed by termination of the method (box 1-5). The second component of the right-hand-side (RHS) of the equation in 11-4 is directly proportional to available bandwidth and cost increases as available bandwidth increases. Given the same Admin cost and Delay parameters, the algorithm selects a more congested (lower available bandwidth) link prior to a link with a higher available bandwidth. This tends to pack more requests on the same link, giving rise to bin-packing. When the available bandwidth of a candidate link considered during a step in path selection becomes less than or equal to demand_threshold (exit “Yes” from box 11-2), step 11-3 of FIG. 11 is executed followed by termination of the method (box 11-5). Since the second term on the RHS of the equation in 11-3 increases with a decrease in available bandwidth, the algorithm tends to load lesser congested links first. Given two links with same Admin and Delay parameters the routing algorithm will choose the link with a higher available bandwidth (lower cost) over a congested link with lesser available bandwidth. This scenario corresponds to load balancing, where the traffic tends to be distributed evenly across the links. The behavior of the algorithm is captured in FIG. 12. The addition of a large number MAX COST (see step 11-3) prevents a link from being selected when other candidate links are operating under demand_threshold. When “abw” for all these links are less than or equal to demand_threshold, the system enters the load balancing mode. Two values for the demand_threshold may be considered further. By setting the demand_threshold to 0, step 11-3 in FIG. 11 is never executed and the system always operates in a bin-packing mode. With a demand_threshold higher than PIR, step 11-4 is never executed and the system always operates in a load balancing mode.

[0094] In another embodiment, the system enables the network operator to select a routing strategy depending upon the nature of request, through an appropriate software mechanism. For example, if most of the requests require small bandwidths, the method described in FIG. 8 may be selected. If a large proportion of the requests are of comparable bandwidths but there are some requests that require large bandwidths, the method described in FIG. 9 may be used. On the other hand if most requests demand large bandwidths of variable size, the method described in FIG. 11 may be preferable.

[0095] Numerous modifications and variations of the present invention are possible in light of the above teachings. It is therefore to be understood that within the scope of the appended claims, the invention may be practiced otherwise than as specifically described herein. 

We claim:
 1. A method of performing multi-constraint routing comprising: determining a composite cost: composite cost(link)=f(metric1, . . . ,metricN); for each of a plurality of links under consideration in a network topology, the composite cost being a function f of a plurality of metrics metric1, . . . metricN for each link, where N>=2; and performing routing through the network topology from a source to a destination based on the composite costs.
 2. A method according to claim 1, wherein the composite cost is determined according to: ${{composite}\quad {{cost}{\quad \quad}({link})}} = {\sum\limits_{i = 1}^{N}{c_{i}\left( {metric}_{i} \right)}^{n{(i)}}}$

where ci is a constant for the ith metric, and n(i) is an exponent for the ith metric.
 3. A method according to claim 2, wherein the composite cost is determined according to: composite cost(link)=a*(1/abw)+b*Admin cost+c*Delay where metric1=abw(available bandwidth), metric2=Admin cost and metric3=Delay (transmission delay), and wherein c1=a (the available bandwidth coefficient), C2=b(the Administrative cost coefficient), and c3=c (the delay coefficient), n(1)=−1, n(2)=1 and n(3)=1.
 4. A method according to claim 1, further comprising, for each link, at least one network node advertising the link's metrics across the network such that any node in the network may implement the multi-constraint routing.
 5. A method according to claim 3, wherein the composite cost increases with decreasing available bandwidth and routing is performed in a manner which promotes load balancing.
 6. A method according to claim 5, further comprising performing the routing in a manner which promotes load balancing with demand reservation on at least one link.
 7. A method according to claim 6, further comprising defining a respective demand threshold for at least one link representing demand reservation for the at least one link.
 8. A method according to claim 7, further comprising: computing a cost for each said at least one link as follows: if (available bandwidth<demand_threshold) cost(link)=composite cost(link)+MAX COST else cost(link)=composite cost(link) where demand_threshold is a respective demand reservation for the link and MAX COST is a very large value.
 9. A method according to claim 8, wherein the demand_threshold is set to a first value for at least one of the links, and is set to a second larger value for at least one of the links whereby bandwidth on the at least one of the links having the first value is reserved for larger bandwidth requests.
 10. A method according to claim 2, comprising computation of a link cost based on the composite cost for switching between a load balancing mode and a bin-packing mode based on available bandwidth of each of a plurality of links under consideration in the network topology.
 11. A method according to claim 10, wherein the switching between the load balancing and the bin-packing modes is performed based on a predetermined demand_threshold value.
 12. A method according to claim 10, further comprising: determining the cost for each said at least one link as follows: If (abw<=demand_threshold) cost(link)=a*Admin cost+b*(abw ^(K) /PIR)+c*Delay+MAX COST else cost(link)=a*Admin cost+b*(PIR/abw ^(K))+c*Delay; wherein PIR=Peak Information Rate, MAX COST is a large number, abw is the available bandwidth and K is a constant.
 13. A method according to claim 12, wherein the constant K can be used to control a rate at which the cost changes with a variation in the available bandwidth.
 14. A method according to claim 12, wherein a different demand_threshold value is used for at least one link for achieving a different switch over point between load balancing and bin-packing.
 15. A method according to claim 12, comprising, performing the load balancing, when the available bandwidth is higher than the demand_threshold.
 16. A method according to claim 12, comprising performing the bin-packing, when the available bandwidth is less than or equal to the demand_threshold.
 17. A method according to claim 12, comprising selection of a higher available bandwidth (less congested link) over a link with a lesser available bandwidth; wherein the cost(link) increases with decrease in the available bandwidth.
 18. A method according to claim 17, comprising selection of a link with a lower available bandwidth over a less congested link, wherein the cost(link) increases with an increase in available bandwidth.
 19. A method according to claim 12, comprising adding a large number (MAX COST) to the cost (link) for preventing the link from being selected, when there is at least one link with available bandwidth higher than the demand_threshold.
 20. A method according to claim 12, comprising setting the demand_threshold to zero, for always operating in the load balancing mode.
 21. A method according to claim 12, comprising setting the demand_threshold to any value higher than PIR, for always operating in the bin-packing mode.
 22. A method according to claim 10, comprising: determining the cost for each said at least one link as follows: If (abw<=demand_threshold) cost(link)=a*Admin cost+b*(PIR/abw ^(K))+c*Delay+MAX COST else cost(link)=a*Admin cost+b*(abw ^(K) /PIR)+c*Delay; wherein PIR=Peak Information Rate, MAX COST is a large number, abw is the available bandwidth and K is a constant.
 23. A method according to claim 22, wherein the constant K can be used to control a rate at which the cost changes with a variation of the available bandwidth.
 24. A method according to claim 22, wherein a different demand_threshold value is used for at least one link for achieving a different switch over point between load balancing and bin-packing.
 25. A method according to claim 22, comprising performing the bin-packing, wherein the available bandwidth is higher than the demand_threshold.
 26. A method according to claim 22, comprising performing the load balancing, wherein the available bandwidth is less than or equal to the demand_threshold.
 27. A method according to claim 22, comprising selection of a higher available bandwidth (less congested link) over a link with a lesser available bandwidth, wherein the cost(link) increases with a decrease in the available bandwidth.
 28. A method according to claim 27, comprising selection of a link with a lower available bandwidth over a less congested link, wherein the cost(link) increases with an increase in available bandwidth.
 29. A method according to claim 22, comprising adding a large number (MAX COST) to the composite cost (link) for preventing the link from being selected, when there is at least one link with available bandwidth higher than the demand_threshold.
 30. A method according to claim 22, comprising setting the demand_threshold to zero, for always operating in the bin-packing mode.
 31. A method according to claim 22, comprising setting the demand_threshold to any value higher than PIR, for operating always in the load balancing mode.
 32. A method according to claim 1, comprising for each of a plurality of different traffic types, using a respective different composite cost equation for calculating the composite costs.
 33. A method according to claim 32, wherein the different traffic types include video, voice and data.
 34. A method according to claim 32, wherein the different traffic types include different classes of service/qualities of service.
 35. A method according to claim 1 further comprising: providing at least one pruning constraint for each link; and pruning the network topology on the basis of the at least one pruning constraints to remove at least one link from the network topology; wherein performing routing through the network from a source to a destination based on the composite costs is conducted using only the links not pruned from the network topology.
 36. A method according to claim 35, wherein pruning the network topology on the basis of the at least one pruning constraints to remove at least one link from the network topology is performed on an as-needed basis to remove one or more links from a set of candidate links.
 37. A method according to claim 36, wherein pruning the network topology on the basis of the at least one pruning constraints to remove at least one link from the network topology is performed on the entire network topology prior to performing the routing.
 38. A method according to claim 37, wherein at least one constraint is used both as a pruning constraint and as a constraint used in the composite costs.
 39. A routing system adapted to perform multi-constraint routing, the system comprising: a topology repository adapted to store information identifying links, nodes and connections of a network; and a multi-constraint router adapted to determine a composite cost: composite cost(link)=f(metric1, . . . ,metricN); for each of a plurality of the links in a network topology, the composite cost being a function f of a plurality of metrics metric1, . . . metricN for each link, where N>=2, and to perform routing through the network topology from a source to a destination based on the composite costs.
 40. A routing system according to claim 39, wherein the multi-constraint router is adapted to determine the composite cost is determined according to: ${{composite}\quad {{cost}{\quad \quad}({link})}} = {\sum\limits_{i = 1}^{N}{c_{i}\left( {metric}_{i} \right)}^{n{(i)}}}$

where ci is a constant for the ith metric, and n(i) is an exponent for the ith metric.
 41. A routing system according to claim 40 wherein the multi-constraint router is adapted to determine the composite cost according to: composite cost(link)=a*(1/abw)+b*Admin cost+c*Delay where metric1=abw (available bandwidth), metric2=Admin cost and metric3=Delay (transmission delay), and c1=a (the available bandwidth coefficient), c2=b (the administrative cost coefficient)and c3=c (the delay coefficient), n(1)=−1, n(2)=1 and n(3)=1.
 42. A routing system according to claim 39, further comprising an input for receiving on an ongoing basis for each link, updated values for the metrics for the link.
 43. A routing system according to claim 39, wherein the multi-constraint router is adapted to perform the routing in a manner which promotes load balancing.
 44. A routing system according to claim 43, wherein the multi-constraint router is adapted to perform the routing in a manner which promotes load balancing with demand reservation for at least one link.
 45. A routing system according to claim 44, wherein the multi-constraint router is adapted to allocate at least one link to contain bandwidth reserved for higher bandwidth requests.
 46. A routing system according to claim 41, wherein the multi-constraint router is adapted to compute the cost for each said at least one link as follows: if (available bandwidth<demand_threshold) cost (link)=composite cost (link)+MAX COST else cost(link)=composite cost(link) where demand_threshold is respective demand reservation for the link and MAX COST is a very large value.
 47. A routing system according to claim 39, adapted to compute the cost for each said at least one link based on the composite cost, comprising a switching means, for switching between a load balancing mode and a bin-packing mode based on available bandwidth of each of a plurality of links under consideration in the network topology.
 48. A routing system according to claim 47, wherein the switching between the load balancing and the bin-packing modes is performed based on a predetermined demand_threshold value.
 49. A routing system according to claim 47, wherein the multi-constraint router is adapted to compute the cost for each link as follows: If (abw<=demand_threshold) cost(link)=a*Admin cost+b*(abw ^(K) /PIR)+c*Delay+MAX COST else cost(link)=a*Admin cost+b*(PIR/abw ^(K))+c*Delay; wherein PIR=Peak Information Rate, MAX COST is a large number, abw is the available bandwidth and K is a constant.
 50. A routing system according to claim 49, wherein the constant K is used to control a rate at which the cost changes with a variation in the available bandwidth.
 51. A routing system according to claim 49, wherein a different demand_threshold value is used for at least one link for achieving a different switch over point between load balancing and bin-packing.
 52. A routing system according to claim 47, wherein the multi-constraint router is adapted to compute the cost for each link as follows: If (abw<=demand_threshold) cost(link)=a*Admin cost+b*(PIR/abw ^(K))+c*Delay+MAX COST else cost(link)=a*Admin cost+b*(abw ^(K) /PIR)+c*Delay; wherein PIR=Peak Information Rate, MAX COST is a large number, abw is the available bandwidth and K is a constant.
 53. A routing system according to claim 51, wherein the constant K can be used to control a rate at which the cost changes with a variation in the available bandwidth.
 54. A routing system according to claim 52, wherein a different demand_threshold value is used for at least one link or achieving a different switch over point between load balancing and bin-packing.
 55. A routing system according to claim 39, wherein the multi-constraint router is adapted to, for each of a plurality of different traffic types, use a respective different composite cost equation for calculating the composite costs.
 56. A routing system according to claim 39, further comprising: a pruning filter adapted to implement at least one pruning constraint by pruning the network topology on the basis of the at least one pruning constraint to remove at least one link from the network topology; wherein the multi-constraint router performs routing through the network from a source to a destination based on the composite costs is conducted using only the links not pruned from the network topology.
 57. A routing system according to claim 55, adapted to prune and compute costs only for links belonging to routes in a candidate list. 